Error-Correcting Codes in Steganography
نویسندگان
چکیده
We investigate image steganography under re-encoding of images. After a secret message or a digital watermark is embedded into a jpeg image, quite frequently the image is re-encoded with a different quality factor. We model this re-encoding as a noisy communication channel with respect to the embedded message, and derive the corresponding error model. We present an error-correcting code that allows complete reconstruction of the embedded message in most cases, and partial reconstruction in all experiments performed, over a wide range of differences in quality factors.
منابع مشابه
Error-Correcting Codes for a Steganography Application
Steganography is the process of inserting hidden messages in an unrelated transmission. An algorithm for steganography that uses an error-correcting code to embed messages in a carrier sequence is studied. A distortion limit theorem from information-theoretic analysis is given, and optimal code parameters are discussed.
متن کاملUsing of Ldpc Codes in Steganography
Steganography is the art of secret communication [1] Since the advent of modern steganography, in the 2000s, many approaches based on error correcting codes (Hamming, BCH, RS ...) have been proposed to reduce the number of changes in the roof while inserting the maximum bit. Jessica Fridrich's works have shown that sparse codes best approach the theoretical limit of efficiency of insertion. Our...
متن کاملA Novel Steganographic Protocol from Error-correcting Codes
The idea of ”Matrix encoding” was introduced in steganography by Crandall in 1998 [6]. The implementation was then proposed by Westfeld with steganography algorithm F5 [1]. The objective is to transmit a message within an image via the modified image, but with the constraint of minimizing the number of coefficients of the image changed. In this paper, new construction of protocol steganography ...
متن کاملThe Use of Side Information in Image Steganography Lisa
The application of error correcting codes for steganographic techniques can improve the BER of the recovered hidden message. We show here several ways that side information can be extracted from the cover data to help improve the performance of the error correction.
متن کاملImproving success probability and embedding efficiency in code based steganography
For stegoschemes arising from error correcting codes, embedding depends on a decoding map for the corresponding code. As decoding maps are usually not complete, embedding can fail. We propose a method to ensure or increase the probability of embedding success for these stegoschemes. This method is based on puncturing codes. We show how the use of punctured codes may also increase the embedding ...
متن کامل